Urn Sampling Without Replacement: Enumerative Combinatorics inR

On Sampling without Replacement and Ok-corral Urn Models

In this work we discuss two urn models with general weight sequences (A,B) associated to them, A = (αn)n∈N andB = (βm)m∈N, generalizing two well known Pólya-Eggenberger urn models, namely the so-called sampling without replacement urn model and the OK Corral urn model. We derive simple explicit expressions for the distribution of the number of white balls, when all black have been drawn, and ob...

Combinatorics Enumerative Combinatorics 05

NSF Proposal: Automated Enumerative Combinatorics Automated Enumerative Combinatorics

My research students and I continued to practice a new research methodology, that can be loosely called rigorous experimental mathematics. It has something in common with both “mainstream” experimental mathematics (as preached by the Borwein brothers, David Bailey, Victor Moll, and their collaborators, see e.g. the masterpiece [BB], and the recent collection [BBCGLM]), and automated theorem pro...

Enumerative Combinatorics 8: Species

In this lecture I will discuss a very nice unifying principle for a number of topics in enumerative combinatorics, the theory of species, introduced by André Joyal in 1981. Species have been used in areas ranging from infinite permutation groups to statistical mechanics, and I can’t do more here than barely scratch the surface. Joyal gave a category-theoretic definition of species; I will take ...

Enumerative combinatorics on words

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...